Computers and Thought Award : Challenges of Massive Parallelism

نویسنده

  • Hiroaki Kitano
چکیده

Artificial Intelligence has been the field of study for exploring the principles underlying thought, and utilizing their discovery to develop use­ ful computers. Traditional AI models have been, consciously or subconsciously, optimized for available computing resources which has led AI in certain directions. The emergence of mas­ sively parallel computers liberates the way in­ telligence may be modeled. Although the AI community has yet to make a quantum leap, there are attempts to make use of the opportu­ nities offered by massively parallel computers, such as memory-based reasoning, genetic algorithms , and other novel models. Even within the traditional AI approach, researchers have begun to realize that the needs for high per­ formance computing and very large knowledge bases to develop intelligent systems requires massively parallel AI techniques. In this Com­ puters and Thought Award lecture, I will argue that massively parallel artificial intelligence will add new dimensions to the ways that the AI goals are pursued, and demonstrate that mas­ sively parallel artificial intelligence is where AI meets the real world.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maslsively Parallel Computers: Why Not Prwallel Computers for the Masses?

During the 1980s the computers engineering and science research community generally ignored parallel processing. With a focus on high performance computing embodied in the massive 1990s High Performance Computing and Communications (HPCC) program that has the short-term, teraflop peak performanc~: goal using a network of thousands of computers, everyone with even passing interest in parallelism...

متن کامل

An Associative Dynamic Convex Hull Algorithm

This paper presents a new parallel algorithm for the dynamic convex hull problem. This algorithm is a parallel adaptation of the Jarvis March Algorithm. The computational model selected for this algorithm is the associative computing model (ASC) which supports massive parallelism through the use of data parallelism and constant time associative search and maximum functions. Also, ASC can be sup...

متن کامل

Promoter an Application-oriented Programming Model for Massive Parallelism

This article deals with rationale and concepts of a programming model for massive parallelism. We mention the basic properties of massively parallel applications and develop a programming model for data paral-lelism on distributed-memory computers. Its key features are a suitable combination of homogeneity and heterogeneity aspects, an uniied representation of data point connguration and interc...

متن کامل

Field Computation and Nonpropositional Knowledge

Most current AI technology has been based on propositionally represented theoretical knowledge. We argue that if AI is to accomplish its goals, especially in the tasks of sensory interpretation and sensorimotor coordination, then it must solve the problem of representing embodied practical knowledge. Biological evidence shows that animals use this knowledge in a way very different from digital ...

متن کامل

Molecular computing revisited: a Moore's Law?

Moore's Law states that the processing power of microchips doubles every one to two years. This observation might apply to the nascent field of molecular computing, in which biomolecules carry out logical operations. Incorporation of new technologies that improve sensitivity and throughput has increased the complexity of problems that can be addressed. It is an ultimate goal for molecular compu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993